A propositional calculus for inconsistent deductive systems
نویسندگان
چکیده
منابع مشابه
Deductive Systems for the Modal mu-Calculus
We survey deductive systems for the modal μ-calculus. The distinguishing feature between different such systems is how minimality of least fixed points is guaranteed. There are basically three ways to achieve this: (i) by induction rules, (ii) by semi-formal rules with infinitely many premises, or (iii) by a global condition on infinitely long proof branches.
متن کاملAn order-theoretic analysis of interpretations among propositional deductive systems
In this paper we study interpretations and equivalences of propositional deductive systems by using a quantale-theoretic approach introduced by Galatos and Tsinakis. Our aim is to provide a general order-theoretic framework which is able to describe and characterize both strong and weak forms of interpretations among propositional deductive systems also in the cases where the systems have diffe...
متن کاملΕ-calculus Based Axiom Systems for Some Propositional Modal Logics
1 Introduction: Instead of considering propositional S4 (say) as a theory built on top of classical propositional logic, we can consider it as the classical first order theory of its Kripke models. This first order theory can be formulated in any of the ways first order theories usually are: tableau, Gentzen system, natural deduction, conventional axiom system, ε-calculus. If the first order th...
متن کاملA Computational Structure for the Propositional Calculus
Despite the long history and descriptive simplicity of the propositional calculus, practical aspects of its implementation on the computer remain an active area of study. We propose a representation of the propositional calculus which is straightforward, yet compact and sufficiently flexible to circumvent the combinatorial difficulties posed by many problems. The methodology does not involve te...
متن کاملA refined calculus for Intuitionistic Propositional Logic
Since 1993, when Hudelmaier developed a O(n logn)-space decision procedure for propositional intuitionistic logic, a lot of work has been done to improve the efficiency of the related proof-search algorithms. This has been done working on proof-search strategies and on implementation structures more than on logical properties of the calculi. In this paper we provide a tableau calculus using the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic and Logical Philosophy
سال: 2004
ISSN: 2300-9802,1425-3305
DOI: 10.12775/llp.1999.003